Two-dimensional strip packing with unloading constraints
نویسندگان
چکیده
منابع مشابه
Two Dimensional Strip Packing with Unloading Constraints
In this paper we present approximation algorithms for the two dimensional strip packing problem with unloading constraints. In this problem, we are given a strip S of width 1 and unbounded height, and n items of C different classes, each item ai with height h(ai), width w(ai) and class c(ai). As in the strip packing problem, we have to pack all items minimizing the used height, but now we have ...
متن کاملHeuristics for the strip packing problem with unloading constraints
This article addresses the Strip Packing Problem with Unloading Constraints (SPU). In this problem, we are given a strip of fixed width and unbounded height, and n items of C different classes. As in the well-known two-dimensional Strip Packing problem, we have to pack all items minimizing the used height, but now we have the additional constraint that items of higher classes cannot block the w...
متن کاملAn Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints
This paper describes a branch-and-cut algorithm for solving a two-dimensional orthogonal packing problem with unloading constraints, which often occurs as a subproblem of mixed vehicle routing and loading problems. At each node of the branching tree, cuts are generated to find a feasible integer solution to a one-dimensional contiguous bin packing problem. If an integer solution is obtained, an...
متن کاملOne-dimensional heuristics adapted for two-dimensional rectangular strip packing
We consider two-dimensional rectangular strip packing without rotation of items and without the guillotine cutting constraint. We propose a single-pass heuristic which fills every free space in a onedimensional knapsack fashion, i.e. considering only item widths. It appears especially important to assign suitable heuristic “pseudo-values” as profits in this knapsack problem. This simple heurist...
متن کاملA Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.08.019